Circular Planar Resistor Networks with Nonlinear and Signed Conductors

نویسنده

  • Will Johnson
چکیده

We consider the inverse boundary value problem in the case of discrete electrical networks containing nonlinear (non-ohmic) resistors. Generalizing work of Curtis, Ingerman, Morrow, Colin de Verdière, Gitler, and Vertigan, we characterize the circular planar graphs for which the inverse boundary value problem has a solution in this generalized non-linear setting. The answer is the same as in the linear setting. Our method of proof never requires that the resistors behave in a continuous or monotone fashion; this allows us to recover signed conductances in many cases. We apply this to the problem of recovery in graphs that are not circular planar. We also use our results to make a frivolous knot-theoretic statement, and to slightly generalize a fact proved by Lam and Pylyavskyy about factorization schemes in their electrical linear group.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Circular planar graphs and resistor networks

We consider circular planar graphs and circular planar resistor networks. Associated with each circular planar graph F there is a set n(F) = { (P; Q) } of pairs of sequences of boundary nodes which are connected through F. A graph F is called critical if removing any edge breaks at least one of the connections (P: Q) in n(F). We prove that two critical circular planar graphs are Y-A equivalent ...

متن کامل

Pseudoline arrangements and the Inverse Boundary Value Problem in Nonlinear Electrical Networks

We consider the inverse boundary value problem in the case of discrete electrical networks containing nonlinear (non-ohmic) conductors. For a fixed nonlinear electrical network, we show that under reasonable assumptions, there are well-defined Dirichletto-Neumann and Neumann-to-Dirichlet maps relating boundary voltages and boundary currents. We also generalize work of Curtis, Morrow, and others...

متن کامل

Forward kinematic analysis of planar parallel robots using a neural network-based approach optimized by machine learning

The forward kinematic problem of parallel robots is always considered as a challenge in the field of parallel robots due to the obtained nonlinear system of equations. In this paper, the forward kinematic problem of planar parallel robots in their workspace is investigated using a neural network based approach. In order to increase the accuracy of this method, the workspace of the parallel robo...

متن کامل

Recovery of Non-linear Conductivities for Circular Planar Graphs

We consider the problem of recovering nonlinear conductances in a circular planar graph. If the graph is critical (in the sense of [2]), and the conductance functions satisfy some weak conditions (such as being bijective), we show that the conductance functions are completely recoverable from the Dirichlet-to-Neumann relationship. This result is general enough that it also demonstrates the reco...

متن کامل

Negative Conductors and Network Planarity

where γ is an intrinsic property of the conductor, known as its conductance. When we speak, therefore, of “positive” and “negative” conductors, we mean conductors whose conductances are positive and negative, respectively. A network of conductors is any number of conductors, joined at the ends; such joinings are known as nodes. If all conductances are positive, this can be represented physicall...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2012